Approximating Weighted and Priced Bribery in Scoring Rules
نویسندگان
چکیده
منابع مشابه
Approximating Bribery in Scoring Rules
The classic bribery problem is to find a minimal subset of voters who need to change their vote to make some preferred candidate win. We find an approximate solution for this problem for a broad family of scoring rules (which includes Borda and t-approval), in the following sense: if there is a strategy which requires bribing k voters, we efficiently find a strategy which requires bribing at mo...
متن کاملComparing Density Forecasts Using Threshold and Quantile Weighted Scoring Rules
We propose a method for comparing density forecasts that is based on weighted versions of the continuous ranked probability score. The weighting emphasizes regions of interest, such as the tails or the center of a variable’s range, while retaining propriety, as opposed to a recently developed weighted likelihood ratio test, which can be hedged. Threshold and quantile based decompositions of the...
متن کاملLikelihood-ratio calibration using prior-weighted proper scoring rules
Prior-weighted logistic regression has become a standard tool for calibration in speaker recognition. Logistic regression is the optimization of the expected value of the logarithmic scoring rule. We generalize this via a parametric family of proper scoring rules. Our theoretical analysis shows how different members of this family induce different relative weightings over a spectrum of applicat...
متن کاملScoring Rules and Consensus
In this paper we consider that voters rank order a set of alternatives and a scoring rule is used for obtaining a set of winning alternatives. The scoring rule we use is not previously fixed, but we analyze how to select one of them in such a way that the collective utility is maximized. In order to generate that collective utility, we ask voters for additional information: agents declare which...
متن کاملApproximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 − ). This improves the previously best approximation ratio of ( 1 2 − ) of an NC algorithm for this problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2019
ISSN: 1076-9757
DOI: 10.1613/jair.1.11538